Linear Complexity of the Balanced Polynomial Quotients Sequences
نویسندگان
چکیده
منابع مشابه
Linear complexity of binary sequences derived from polynomial quotients
We determine the linear complexity of p-periodic binary threshold sequences derived from polynomial quotient, which is defined by the function (u−u)/p (mod p). When w = (p−1)/2 and 2p−1 6≡ 1 (mod p), we show that the linear complexity is equal to one of the following values { p − 1, p − p, (p + p)/2 + 1, (p − p)/2 } , depending whether p ≡ 1, −1, 3, −3 (mod 8). But it seems that the method can’...
متن کاملLinear complexity of Legendre-polynomial quotients
We continue to investigate binary sequence (fu) over {0, 1} defined by (−1)fu = ( (u−u)/p p ) for integers u ≥ 0, where ( · p ) is the Legendre symbol and we restrict ( 0 p ) = 1. In an earlier work, the linear complexity of (fu) was determined for w = p − 1 under the assumption of 2p−1 6≡ 1 (mod p2). In this work, we give possible values on the linear complexity of (fu) for all 1 ≤ w < p− 1 un...
متن کاملInstitutional Repository Linear complexity for sequences with characteristic polynomial fv
We present several generalisations of the GamesChan algorithm. For a fixed monic irreducible polynomial f we consider the sequences s that have as characteristic polynomial a power of f . We propose an algorithm for computing the linear complexity of s given a full (not necessarily minimal) period of s. We give versions of the algorithm for fields of characteristic 2 and for arbitrary finite ch...
متن کاملLinear Complexity for Sequences with Characteristic Polynomial f v Alex
We present several generalisations of the GamesChan algorithm. For a fixed monic irreducible polynomial f we consider the sequences s that have as characteristic polynomial a power of f . We propose an algorithm for computing the linear complexity of s given a full (not necessarily minimal) period of s. We give versions of the algorithm for fields of characteristic 2 and for arbitrary finite ch...
متن کاملExtremal sequences of polynomial complexity
The joint spectral radius of a bounded set of d × d real matrices is defined to be the maximum possible exponential growth rate of products of matrices drawn from that set. For a fixed set of matrices, a sequence of matrices drawn from that set is called extremal if the associated sequence of partial products achieves this maximal rate of growth. An influential conjecture of J. Lagarias and Y. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2018
ISSN: 2261-236X
DOI: 10.1051/matecconf/201822801014